A Generalized Particle Search–Locate Algorithm for Arbitrary Grids

to carry out searching and interpolation efficiently. Brackbill and Ruppert [6] and Westermann [7] have designed A generalized iterative algorithm for searching and locating particles in arbitrary meshes is presented. The algorithm uses Newton schemes to perform searching and bilinear interpolation on method to invert a bijective map of the mesh elements onto a structured meshes composed of nonuniform quadrilaterals. reference element, together with a criterion to move from element Löhner and Ambrosiano [8] devised an algorithm for unto element in the mesh. The generality of the method is shown structured meshes composed of linear triangles or tetraby explicit formulations for linear and quadratic triangular and hedra. Although they differ on implementational aspects, quadrilateral elements. Numerical examples demonstrate the performance of the method as well as its higher accuracy and all these works share the idea described in the following. versatility. Q 1997 Academic Press Given a domain V (for simplicity, we assume that V is in the plane, i.e., V , R2) on which a mesh has been generated, one wishes to know the element Vj of the mesh,